Finding Optimal Solutions to Atomix
نویسندگان
چکیده
We present solutions of benchmark instances to the solitaire computer game Atomix found with different heuristic search methods. The problem is PSPACE-complete. An implementation of the heuristic algorithm A* is presented that needs no priority queue, thereby having very low memory overhead. The limited memory algorithm IDA* is handicapped by the fact that, due to move transpositions, duplicates appear very frequently in the problem space; several schemes of using memory to mitigate this weakness are explored, among those, “partial” schemes which trade memory savings for a small probability of not finding an optimal solution. Even though the underlying search graph is directed, backward search is shown to be viable, since the branching factor can be proven to be the same as for forward search.
منابع مشابه
Assembling molecules in ATOMIX is hard
It is shown that assembling molecules in the ATOMIX game can be used to simulate 0nite automata. In particular, an instance of ATOMIX is constructed that has a solution if and only if the non-emptiness intersection problem for 0nite automata is solvable. This shows that the game under consideration is PSPACE-complete, improving a recent result of H5 u6ner et al. (Lecture Notes in Computer Scien...
متن کاملA full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem
This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...
متن کاملAtomix: A Framework for Deploying Signal Processing Applications on Wireless Infrastructure
Multi-processor DSPs have become the platform of choice for wireless infrastructure. This trend presents an opportunity to enable faster and wider scale deployment of signal processing applications at scale. However, achieving the hardware-like performance required by signal processing applications requires interacting with bare metal features on the DSP. This makes it challenging to build modu...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کامل